On revising fuzzy belief bases
نویسندگان
چکیده
We look at the problem of revising fuzzy be lief bases, i.e., belief base revision in which both formulas in the base as well as revision input formulas can come attached with vary ing truth-degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy log ics, we show how the idea of rational change from "crisp" base revision, as embodied by the idea of partial meet (base) revision, can be faithfully extended to revising fuzzy belief bases. We present and axiomatise an oper ation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework.
منابع مشابه
REVISE: An Extended Logic Programming System for Revising Knowledge Bases
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued assumption revision to face contradiction , encompasses the notion of preference levels. Its reliance on logic programming allows efficient computation and declarativity, whilst its use of explicit negation, revision ...
متن کاملRevising General Knowledge Bases in Description Logics
This paper introduces a new methodology of revising general KBs in DL-Lite. Two specific revision operators are defined, their properties are investigated and algorithms for computing revisions are developed.
متن کاملComputing multiple c-revision using OCF knowledge base
Belief revision is the process of revising epistemic states in the light of new information. In this paper epistemic states are represented in the framework of Spohn’s Ordinal Conditional Functions (OCF). The input is a consistent set of propositional formulas issued from different and independent sources. We focus on the so-called multiple iterated belief crevision recently proposed by Kern-Is...
متن کاملA Minimal Modelling for Successful KnowledgeBase
A minimal approach to modelling belief change is presented, wherein arguably all successful belief change operators are captured. Two assumptions are made: that a notion of similarity between knowledge bases underlies revision, and that the belief change operator being modelled is successful, in that if a knowledge base K is revised by a sentence then will be in the revised knowledge base. The ...
متن کاملMinimal Modelling for Successfulknowledge Base
A minimal approach to modelling belief change is presented, wherein arguably all successful belief change operators are captured. Two assumptions are made: that a notion of similarity between knowledge bases underlies revision, and that the belief change operator being modelled is successful, in that if a knowledge base K is revised by a sentence then will be in the revised knowledge base. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 80 شماره
صفحات -
تاریخ انتشار 2003